PROFINITENESS IN FINITELY GENERATED VARIETIES IS UNDECIDABLE
نویسندگان
چکیده
منابع مشابه
Chief Factor Sizes in Finitely Generated Varieties
Let A be a k-element algebra whose chief factor size is c. We show that if B is in the variety generated by A, then any abelian chief factor of B that is not strongly abelian has size at most ck−1. This solves Problem 5 of The Structure of Finite Algebras, by D. Hobby and R. McKenzie. We refine this bound to c in the situation where the variety generated by A omits type 1. As a generalization, ...
متن کاملA Decidable Variety That Is Finitely Undecidable
We construct a decidable rst-order theory T such that the theory of its nite models is undecidable. Moreover, T will be equationally axiomatizable and of nite type.
متن کاملTwo Finitely Generated Varieties Having No Infinite Simple Members
Using a method of R. McKenzie, we construct a finitely generated semisimple variety of infinite type, and a finitely generated nonsemisimple variety of finite type, both having arbitrarily large finite but no infinite simple members. This amplifies M. Valeriote’s negative solution to Problem 11 from [1]. R. McKenzie [2] has constructed a finitely generated variety having arbitrarily large finit...
متن کاملFinitely Generated Varieties with Small 〈r, S〉-irreducible Sets
Let V be a finitely generated variety of algebras. We show that there is a finite bound on the size of the 〈R,S〉-irreducible sets of finite algebras in V iff V is congruence 3-permutable and has a near unanimity term operation of some arity.
متن کاملThe Word Problem for Finitely Presented Quandles is Undecidable
This work presents an algorithmic reduction of the word problem for recursively presented groups to the word problem for recursively presented quandles. The faithfulness of the reduction follows from the conjugation quandle construction on groups. It follows that the word problem for recursively presented quandles is not effectively computable, in general. This article also demonstrates that a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 2018
ISSN: 0022-4812,1943-5886
DOI: 10.1017/jsl.2017.89